22. Generate Parentheses - LeetCode Solution


Backtracking String

Python Code:

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        
        a = []
        
        
        actual = n
        def trav(n, b, i, j):
            if len(b) == 2*n:
                a.append(b)
                return 
            
            for k in range(i, n, 1):
                trav(n, b+"(", k+1, j)
            
            for l in range(j, i, 1):
                trav(n, b+")", i, l+1)
                
                

        
        trav(n, "", 0, 0)
        
        return a
            


Comments

Submit
1 Comments
  • 2/4/2024 11:54 - Europe/Moscow

String i = "";


More Questions

822A - I'm bored with life
9A - Die Roll
1430B - Barrels
279B - Books
1374B - Multiply by 2 divide by 6
1093B - Letters Rearranging
1213C - Book Reading
1468C - Berpizza
1546B - AquaMoon and Stolen String
1353C - Board Moves
902A - Visiting a Friend
299B - Ksusha the Squirrel
1647D - Madoka and the Best School in Russia
1208A - XORinacci
1539B - Love Song
22B - Bargaining Table
1490B - Balanced Remainders
264A - Escape from Stones
1506A - Strange Table
456A - Laptops
855B - Marvolo Gaunt's Ring
1454A - Special Permutation
1359A - Berland Poker
459A - Pashmak and Garden
1327B - Princesses and Princes
1450F - The Struggling Contestant
1399B - Gifts Fixing
1138A - Sushi for Two
982C - Cut 'em all
931A - Friends Meeting